Diagonalization of matrices over rings
نویسندگان
چکیده
منابع مشابه
On nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملon nest modules of matrices over division rings
let $ m , n in mathbb{n}$, $d$ be a division ring, and $m_{m times n}(d)$ denote the bimodule of all $m times n$ matrices with entries from $d$. first, we characterize one-sided submodules of $m_{m times n}(d)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $d$. next, we introduce the notion of a nest module of matrices with entries from $d$. we ...
متن کاملDiagonalization of Sp(2) matrices
The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a similarity transformation of the two-by-two Wigner matrix, derivable from Wigner’s little group which dictates the internal space-time symmetries of relativistic particles. The Wigner matrix can be diagon...
متن کاملQuantum Diagonalization of Hermitean Matrices
To measure an observable of a quantum mechanical system leaves it in one of its eigenstates and the result of the measurement is one of its eigenvalues. This process is shown to be a computational resource. It allows one, in principle, to diagonalize hermitean (N × N) matrices by quantum mechanical measurements only. To do so, one considers the given matrix as an observable of a single spin wit...
متن کاملCryptanalysis of Some Protocols Using Matrices over Group Rings
It is important to search for easily implementable groups, for which the DL problem is hard and there is no known subexponential time algorithm for computing DL. The group of points over Fq of an elliptic curve is such a group. In [8], the group of invertible matrices with coefficients in a finite field was considered for such a key exchange. In [6], using the Jordan form it was shown that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2013
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2012.10.029